Matching in the Pi-Calculus
نویسندگان
چکیده
We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encodings that allows much more freedom (e.g. instead of direct translations of observables it allows comparison of calculi with respect to reachability of successful states). In this paper, we offer a considerably stronger separation result on the non-expressibility of matching using only Gorla’s relaxed requirements.
منابع مشابه
Matching Systems for Concurrent Calculi
Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic ...
متن کاملA Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)
Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or co...
متن کاملPsi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus. Psi-calculi can capture the same phenomena as other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, ...
متن کاملMatching in the Pi-Calculus (Technical Report)
We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...
متن کاملSorted Psi-calculi with Generalised Pattern Matching with proofs
Psi-calculi is a formally verified parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. Although this framework in its original form exhibits considerable expressiveness, many applied computational models cannot be directly represented in it. In this paper we extend the applicability of psi-calculi in three ways. Fir...
متن کاملExtended pi-Calculi
We demonstrate a general framework for extending the picalculus with data terms. In this we generalise and improve on several related efforts such as the spi calculus and the applied pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definiti...
متن کامل